Sieving alive or after fixation: effects of sieving procedure on macrobenthic diversity, density and community structure
نویسندگان
چکیده
منابع مشابه
Block Sieving Algorithms Block Sieving Algorithms
Quite similiar to the Sieve of Erastosthenes, the best-known general algorithms for fac-toring large numbers today are memory-bounded processes. We develop three variations of the sieving phase and discuss them in detail. The fastest modiication is tailored to RISC processors and therefore especially suited for modern workstations and massively parallel supercomputers. For a 116 decimal digit c...
متن کاملImproved Sieving on Algebraic Curves
The best algorithms for discrete logarithms in Jacobians of algebraic curves of small genus are based on index calculus methods coupled with large prime variations. For hyperelliptic curves, relations are obtained by looking for reduced divisors with smooth Mumford representation [4]; for non-hyperelliptic curves it is faster to obtain relations using special linear systems of divisors [2, 3]. ...
متن کاملCyclic Sieving Phenomenon on Matchings
School of Mathematical and Statistical Sciences, Arizona State University Abstract. Reiner-Stanton-White defined the cyclic sieving phenomenon (CSP) associated to a finite cyclic group action on a finite set and a polynomial. Sagan observed the CSP on the set of non-crossing matchings on [2n] := {1, 2, . . . , 2n} using the cyclic group C2n generated by a cyclic shift of order 2n and the q-Cata...
متن کاملThe cyclic sieving phenomenon
The cyclic sieving phenomenon is defined for generating functions of a set affording a cyclic group action, generalizing Stembridge’s q 1⁄4 1 phenomenon. The phenomenon is shown to appear in various situations, involving q-binomial coefficients, Pólya–Redfield theory, polygon dissections, noncrossing partitions, finite reflection groups, and some finite field q-analogues. r 2004 Elsevier Inc. A...
متن کاملSieving in Function Fields
We present the rst implementation of sieving techniques in the context of function elds. More precisely, we compute in class groups of quadratic congruence function elds by combining the Algorithm of Hafner and McCurley with sieving ideas known from factoring. We apply our methods to compute generators and relations of the Jacobian variety of hyperelliptic curves over nite elds.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Helgoland Marine Research
سال: 2007
ISSN: 1438-387X,1438-3888
DOI: 10.1007/s10152-007-0062-y